Speech Compression Based on Discrete Walsh Hadamard Transform
نویسنده
چکیده
This paper presents a new lossy compression algorithm for stationary signal based on Discrete Walsh Hadamard Transform (DWHT). The principle of compression algorithm consists in framing the original speech signal into stationary frames and applying the DWHT. Then, the obtained coefficients are thresholded in order to truncate all coefficients below a given thresholds values. Compression is achieved by efficient encoding of the string values of zeros. A comparative study of performance between the algorithms based on DWHT and Discrete Wavelet Transform (DWT) is performed in terms of some objective criteria: compression ratio (CR), signal to noise ratio, peak signal to noise ratio (SNR), normalized root mean square error (NRMSE) and CPU time. The simulation results show that the algorithm based on DWHT is characterized by a very low complexity implementation and improved CR, SNR, PSNR and NRMSE compared to the DWT algorithm and this for stationary frame.
منابع مشابه
Lossless Image Compression using Zipper Transformation
This paper proposes a lossless compression scheme for greyscale images using Zipper Transformation (ZT) and Inverse Zipper Transformation (iZT). The proposed transformation exploits the conjugate symmetry property of DFT. We benchmark the proposed ZT with both Discrete Cosine Transformation (DCT) and Fast Walsh Hadamard Transformation (FWHT) in order to quantify the efficacy of the proposed tra...
متن کاملPerformance analysis of different orthogonal transform for image processing application
In modern communication technologies, the demand of image data compression increasing rapidly. This paper presents different methods for image compression like DCT, Walsh, Hadamard and Walsh Hadamard. Main objective of this paper is to achieve the higher compression ratio and lower the Mean square error. Different test images over different orthogonal transform are used to achieve the performan...
متن کاملInteger Discrete Cosine Transform via Lossless Walsh-Hadamard Transform with Structural Regularity for Low-Bit-Word-Length
This paper presents an integer discrete cosine transform (IntDCT) with only dyadic values such as k/2n (k, n ∈ N). Although some conventional IntDCTs have been proposed, they are not suitable for lossless-to-lossy image coding in low-bit-word-length (coefficients) due to the degradation of the frequency decomposition performance in the system. First, the proposed M-channel lossless Walsh-Hadama...
متن کاملA Comparison of Discrete Orthogonal Basis Functions for Image Compression
In this report we analyse the image reconstruction accuracy when using different orthogonal basis functions as the kernel for a reversible image transform. In particular we examine the Discrete Cosine Transform(DCT), Discrete Tchebichef Transform(DTT), Haar Transform, and Walsh-Hadamard Transforms(WHT). We have found that the DCT provides the greatest energy compactness properties for continuou...
متن کاملImproving SOM Vector Quantization for Image Compression with Walsh-Hadamard Transform
The bandwidth reduction or storage lowering in digital image transmission confers to the image compression a key role. In this paper, we propose a new approach for lossy image compression: the source image is vector quantized by applying Self-Organizing Map (SOM) with several dictionaries. Each dictionary is originally designed based on the feature vectors resulted after applying the Walsh-Hada...
متن کامل